A geometrical inverse problem

A geometrical interpretation of the inverse matrix

Inverse feasible problem

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

On a Geometrical Interpolation Problem

Given a finite set of points A in R and a geometrical pattern Φ we define a type of distance between A and Φ and study how to find a pattern Φ among a parametrized family of geometrical objects such that such a distance is minimum. Mathematics Subject Classification: 41A29

Parameter determination in a parabolic inverse problem in general dimensions

It is well known that the parabolic partial differential equations in two or more space dimensions with overspecified boundary data, feature in the mathematical modeling of many phenomena. In this article, an inverse problem of determining an unknown time-dependent source term of a parabolic equation in general dimensions is considered. Employing some transformations, we change the inverse prob...